Simplification of the Lattice Based Attack of Boneh and Durfee for RSA Cryptoanalysis

In this paper we present a new formulation and its simpler analysis of the lattice based attack of Boneh and Durfee for the RSA cryptography [2]. We follow the same approach of Boneh and Durfee, however we propose a new way of defining a lattice with which we can achieve the same solvable key bound d < N. Our lattice is represented as a lower triangle matrix, which makes its analysis much simpler that of [2]. We think that this simpler analysis would be useful for considering applications/generalisations of this approach. In fact, as an example of such applications, we give a way of attacking RSA secret key with a certain repetitive structure.